Boolean satisfiability problem

Results: 324



#Item
11Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2010-08-28 23:41:19
12Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction

Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction

Add to Reading List

Source URL: fm.csl.sri.com

Language: English - Date: 2010-10-30 02:14:08
13A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-04-03 11:35:00
14Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:56:36
15Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
16¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning II”

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning II”

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2013-08-19 07:30:22
17Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
18On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
19Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2

Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55